A FEW PROBLEMS ON LAMINOGRAPHY
نویسندگان
چکیده
منابع مشابه
A Few Problems on Monodromy and Discriminants
The article contains several problems concerning local monodromy groups of singularities, Lyashko–Looijenga maps, integral geometry, and topology of spaces of real algebraic manifolds.
متن کاملA few remarks on Ramsey-Tura'n-type problems
Let H be a fixed forbidden graph and let f be a function of n: Denote by RTðn;H; f ðnÞÞ the maximum number of edges a graph G on n vertices can have without containing H as a subgraph and also without having at least f ðnÞ independent vertices. The problem of estimating RTðn;H; f ðnÞÞ is one of the central questions of so-called Ramsey–Turán theory. In their recent paper (Discrete Math. 229 (20...
متن کاملApplying a Priori Information to Computed Laminography
Reconstructed 3D volumes from computed laminography data suffer from blurring artefacts due to the laminographic geometry. Such losses in quality can be tackled by the use of a priori information about the test object which can be integrated into the iterative reconstruction process. However, this requires the position of the a priori model to be fitted exactly to the measured data. A (semi-)au...
متن کاملMaximization coloring problems on graphs with few P4
Given a graph G= (V,E), a greedy coloring of G is a proper coloring such that, for each two colors i< j, every vertex of V (G) colored j has a neighbor with color i. The greatest k such that G has a greedy coloring with k colors is the Grundy number of G. A b-coloring of G is a proper coloring such that every color class contains a vertex which is adjacent to at least one vertex in every other ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Japanese Journal of Radiological Technology
سال: 1959
ISSN: 0369-4305,1881-4883
DOI: 10.6009/jjrt.kj00001365776